The graphs that can be drawn with one bend per edge
نویسندگان
چکیده
We provide a precise description of the class of graphs that admit a one-bend drawing, i.e., an orthogonal drawing with at most one bend per edge. The main tools for the proof are Eulerian orientations of graphs and discrete harmonic functions. Mathematics Subject Classi cations (2010) 05C62,
منابع مشابه
Relating Graph Thickness to Planar Layers and Bend Complexity
The thickness of a graph G = (V,E) with n vertices is the minimum number of planar subgraphs of G whose union is G. A polyline drawing of G in R is a drawing Γ of G, where each vertex is mapped to a point and each edge is mapped to a polygonal chain. Bend and layer complexities are two important aesthetics of such a drawing. The bend complexity of Γ is the maximum number of bends per edge in Γ,...
متن کاملPlanar Octilinear Drawings with One Bend Per Edge
In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal (45◦) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree less or equal to k. In particular, we prove that every 4-planar graph admits a planar...
متن کاملBend-optimal orthogonal graph drawing in the general position model
We consider orthogonal drawings in the general position model, i.e., no two points share a coordinate. The drawings are also required to be bend minimal, i.e., each edge of a drawing in k dimensions has exactly one segment parallel to each coodinate direction that are glued together at k − 1 bends. We provide a precise description of the class of graphs that admit an orthogonal drawing in the g...
متن کاملUniversal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
متن کاملUniversal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is that any number of planar graphs admit a simultaneous embedding without mapping with at most one bend per edge.
متن کامل